Computational complexity theory - PDFSEARCH.IO - Document Search Engine

Computational complexity theory
Results: 2049

#	Item
521	CS 373: Combinatorial Algorithms, Spring 1999 Final Exam (May 7, 1999) Name: Net ID: Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 08:54:06 Analysis of algorithms NP-complete problems Operations research Mathematical optimization Dynamic programming Randomized algorithm Algorithm Time complexity Knapsack problem Theoretical computer science Computational complexity theory Applied mathematics
522	Meeting the Deadline: On the Complexity of Fault-Tolerant Continuous Gossip ∗ † Chryssis Georgiou Add to Reading List Source URL: www.comp.nus.edu.sg Language: English - Date: 2011-11-17 23:45:09 Analysis of algorithms Human communication Complexity classes Gossip protocol Network architecture Randomized algorithm Consensus Time complexity Distributed computing Theoretical computer science Computational complexity theory Applied mathematics
523	Originally published in Proc. 3rd WALCOM, LNCS. Springer, 2009. To appear. Parameterized Complexity of Stabbing Rectangles and Squares in the Plane Michael Dom1 and Michael R. Fellows2,⋆ and Frances A. Rosamond2,⋆ 1 Add to Reading List Source URL: theinf1.informatik.uni-jena.de Language: English - Date: 2008-12-19 10:15:00 Applied mathematics Computational complexity theory Quadrilaterals Rectangle Matrix Dominating set Vertex cover Parameterized complexity Clique Theoretical computer science NP-complete problems Mathematics
524	CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 A Distributed Algorithm for Approximate Mobile Sensor Coverage Esther Ezra∗ Jiemin Zeng† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2014-07-29 13:44:18 NP-complete problems Complexity classes Approximation algorithms Operations research Set cover problem Polynomial-time approximation scheme Time complexity Linear programming relaxation NP Theoretical computer science Computational complexity theory Applied mathematics
525	Susan Margulies margulie at usna dot edu United States Naval Academy, Department of Mathematics, Annapolis, MDResearch Interests Optimization, Graph Theory, Computer Algebra, Algorithms and Complexity, Quantum Com Add to Reading List Source URL: www.usna.edu Language: English - Date: 2015-05-19 21:11:47 Mathematics Convex optimization Mathematical optimization Computational problems Combinatorial optimization Computational complexity theory Combinatorics Linear programming Discrete mathematics Operations research Theoretical computer science Applied mathematics
526	CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 Geometric Hitting Set and Set Cover Problems with Half-Strips Apurva Mudgal ∗, ‡ Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2014-06-20 06:19:10 Mathematical logic Computational complexity theory Gadget Clause Variable Theoretical computer science Mathematics Logic programming
527	review-article2015 CPXXXX10.1177/2167702614562040Huys et al.Decision-Theoretic Psychiatry Add to Reading List Source URL: www.quentinhuys.com Language: English - Date: 2015-05-17 06:35:08 Science Control theory Decision theory Prior probability Computational complexity theory Economic model Utility Statistics Bayesian statistics Probability and statistics
528	Online Bipartite Perfect Matching With Augmentations Kamalika Chaudhuri∗ , Constantinos Daskalakis† , Robert D. Kleinberg‡ , and Henry Lin† ∗ Information Theory and Applications Center, U.C. San Diego Add to Reading List Source URL: cseweb.ucsd.edu Language: English - Date: 2011-01-01 02:41:47 Analysis of algorithms Combinatorial optimization Matching Randomized algorithm Load balancing Server SL Big O notation Hopcroft–Karp algorithm Theoretical computer science Computational complexity theory Mathematics
529	Parameterized Complexity-News The Newsletter of the Parameterized Complexity Community Volume 2, NovemberWelcome Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-09-04 06:03:49 NP-complete problems Analysis of algorithms Parameterized complexity Graph coloring Bidimensionality Kernelization Dominating set Branch-decomposition Vertex cover Theoretical computer science Graph theory Computational complexity theory
530	Optimal-Time Adaptive Strong Renaming, with Applications to Counting [Extended Abstract] Dan Alistarh ∗ EPFL Add to Reading List Source URL: www.comp.nus.edu.sg Language: English - Date: 2011-11-17 23:45:10 Sorting algorithms Computational complexity theory Analysis of algorithms Algorithm Mathematical logic Randomized algorithm Time complexity Consensus Sorting network Theoretical computer science Applied mathematics Mathematics

UPDATE